NP-complete problems

Results: 1536



#Item
31Finding Common Structured Patterns in Linear Graphs ? Guillaume Fertin LINA, CNRS UMR 6241, Universit´e de Nantes, 2 rue de la Houssini`ere, 44322 Nantes, France

Finding Common Structured Patterns in Linear Graphs ? Guillaume Fertin LINA, CNRS UMR 6241, Universit´e de Nantes, 2 rue de la Houssini`ere, 44322 Nantes, France

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2011-04-27 05:27:10
32On Local Fixing Michael K¨onig and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland {mikoenig, wattenhofer}@ethz.ch Fax: +

On Local Fixing Michael K¨onig and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland {mikoenig, wattenhofer}@ethz.ch Fax: +

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2015-05-18 12:16:02
33Moment methods in extremal geometry David de Laat Delft University of Technology (Joint with Fernando Oliveira and Frank Vallentin) 51st Dutch Mathematical Congress

Moment methods in extremal geometry David de Laat Delft University of Technology (Joint with Fernando Oliveira and Frank Vallentin) 51st Dutch Mathematical Congress

Add to Reading List

Source URL: www.daviddelaat.nl

Language: English
34–Independent Work Report Spring,2014– Exploring Self-Organizing Learning Groups in an Online Learning Platform: Classroom Salon Brandon Lam Advisor: Dr. Ananda Gunawardena

–Independent Work Report Spring,2014– Exploring Self-Organizing Learning Groups in an Online Learning Platform: Classroom Salon Brandon Lam Advisor: Dr. Ananda Gunawardena

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2014-05-16 16:36:56
35A Polynomial-Time Approximation Scheme for Maximum Quartet Compatibility

A Polynomial-Time Approximation Scheme for Maximum Quartet Compatibility

Add to Reading List

Source URL: tandy.cs.illinois.edu

Language: English - Date: 2015-04-08 19:35:45
36Although the result is correct, the algorithm and analysis presented in this paper contain non-trivial errors. These have been fixed in a technical report (availabe at http://www.disco.ethz.ch/publications/planarmds_-1.p

Although the result is correct, the algorithm and analysis presented in this paper contain non-trivial errors. These have been fixed in a technical report (availabe at http://www.disco.ethz.ch/publications/planarmds_-1.p

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:36:22
37A. Daneshgar: Extended abstract of my talk at IUTFebruaryDo Graphs Admit Topological Field Theories? Amir Daneshgar

A. Daneshgar: Extended abstract of my talk at IUTFebruaryDo Graphs Admit Topological Field Theories? Amir Daneshgar

Add to Reading List

Source URL: sharif.ir

Language: English - Date: 2013-10-17 07:17:33
38Online Matching: Haste makes Waste! (Full Version)∗ Yuval Emek† Shay Kutten‡

Online Matching: Haste makes Waste! (Full Version)∗ Yuval Emek† Shay Kutten‡

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2016-06-22 05:23:03
39TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel

TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel

Add to Reading List

Source URL: www.iwr.uni-heidelberg.de

Language: English - Date: 2013-06-19 04:16:58
401 Optimizing Busy Time on Parallel Machines George B. Mertzios∗ , Mordechai Shalom† , Ariella Voloshin‡ , Prudence W.H. Wong§ and Shmuel Zaks‡ ∗ School of Engineering and Computing Sciences, Durham University

1 Optimizing Busy Time on Parallel Machines George B. Mertzios∗ , Mordechai Shalom† , Ariella Voloshin‡ , Prudence W.H. Wong§ and Shmuel Zaks‡ ∗ School of Engineering and Computing Sciences, Durham University

Add to Reading List

Source URL: cgi.csc.liv.ac.uk

Language: English - Date: 2012-02-08 11:20:14